Restricted set addition in Abelian groups : results and conjectures par
نویسندگان
چکیده
We present a system of interrelated conjectures which can be considered as restricted addition counterparts of classical theorems due to Kneser, Kemperman, and Scherk. Connections with the theorem of Cauchy-Davenport, conjecture of ErdősHeilbronn, and polynomial method of Alon-Nathanson-Ruzsa are discussed. The paper assumes no expertise from the reader and can serve as an introduction to the subject.
منابع مشابه
Pairwise non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups
Let $G$ be a finite group. A subset $X$ of $G$ is a set of pairwise non-commuting elements if any two distinct elements of $X$ do not commute. In this paper we determine the maximum size of these subsets in any finite non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup.
متن کاملAddendum to: "Infinite-dimensional versions of the primary, cyclic and Jordan decompositions", by M. Radjabalipour
In his paper mentioned in the title, which appears in the same issue of this journal, Mehdi Radjabalipour derives the cyclic decomposition of an algebraic linear transformation. A more general structure theory for linear transformations appears in Irving Kaplansky's lovely 1954 book on infinite abelian groups. We present a translation of Kaplansky's results for abelian groups into the terminolo...
متن کاملOn component extensions locally compact abelian groups
Let $pounds$ be the category of locally compact abelian groups and $A,Cin pounds$. In this paper, we define component extensions of $A$ by $C$ and show that the set of all component extensions of $A$ by $C$ forms a subgroup of $Ext(C,A)$ whenever $A$ is a connected group. We establish conditions under which the component extensions split and determine LCA groups which are component projective. ...
متن کاملOn Restricted Set Addition in Abelian Groups
Let A be a set of k elements of an Abelian group G in which the order of the smallest nonzero subgroup is at least 2k − 3. Then the number of different elements of G that can be written in the form a + a′, where a, a′ ∈ A, a 6= a′, is at least 2k − 3, as it has been shown in [12]. Here we give yet another proof of this result.
متن کاملSum-dominant sets and restricted-sum-dominant sets in finite abelian groups
A+A = {ai + aj : ai, aj ∈ A}, A−A = {ai − aj : ai, aj ∈ A}, A +̂A = {ai + aj : ai, aj ∈ A and ai 6= aj} respectively. Here we refer to sets A with |A+A| > |A−A| as sum-dominant (some authors use the term MSTD, for more sums than differences sets). Though the fact that addition is commutative but subtraction usually is not might naively suggest that sum-dominant sets are rare if they exist at all...
متن کامل